- all integer problem
- полностью целочисленная задача
Англо-русский словарь по экономике и финансам. — М.: Экономическая школа. А.В. Аникин, И.М. Оседчая, Б.Г. Федоров. 1993.
all integer problem
Смотреть что такое "all integer problem" в других словарях:
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Trigonometric moment problem — In mathematics, the trigonometric moment problem is formulated as follows: given a finite sequence { α 0, ... αn }, does there exist a positive Borel measure mu; on the interval [0, 2 pi; ] such that:alpha k = frac{1}{2 pi}int 0 ^{2 pi} e^{… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Waring's problem — In number theory, Waring s problem, proposed in 1770 by Edward Waring, asks whether for every natural number k there exists an associated positive integer s such that every natural number is the sum of at most s k th powers of natural numbers… … Wikipedia
Coin problem — With only 2 pence and 5 pence coins, one cannot make 3 pence, but one can make any higher amount. The coin problem (also referred to as the Frobenius coin problem or Frobenius problem, after the mathematician Ferdinand Frobenius) is a… … Wikipedia
On-Line Encyclopedia of Integer Sequences — URL oeis.org Created by Neil Sloane Launched 1996 ( … Wikipedia
Znám's problem — In number theory, Znám s problem asks which sets of k integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám s problem is named after the Slovak mathematician… … Wikipedia
Hilbert's tenth problem — is the tenth on the list of Hilbert s problems of 1900. Its statement is as follows:Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it… … Wikipedia
Cutting stock problem — The cutting stock problem is an optimization problem, or more specifically, an integer linear programming problem. It arises from many applications in industry. Imagine that you work in a paper mill and you have a number of rolls of paper of… … Wikipedia
Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any … Wikipedia
